Hash-Routing for Collections of Shared Web Caches
نویسنده
چکیده
Shared Web caches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization which provides shared caching to its Web clients will typically have a collection of shared caches rather than just one. For collections of shared caches, it is desirable to coordinate the caches so that all cached pages in the collection are shared among the organization's clients. In this paper we investigate two classes of protocols for coordinating a collection of shared caches: the ICP protocol, which has caches ping each other to locate a cached object; and the hash-routing protocols, which place objects in the shared caches as a function of the objects' URLs. Our contribution is twofold. First, we compare the performance of the protocols with respect to cache-server overhead and to object-retrieval latency; for a collection of shared caches, our analysis shows that the hash routing schemes have signiicant performance advantages over ICP for both of the performance metrics. The existing hash-routing protocols assume that the cache servers are homogeneous in storage capacity and processing capability, even though most collections of cache servers are vastly heterogeneous. Our second contribution is to extend a robust hash-routing scheme so that it balances requests among the caches according to any desired distribution; the extended hash-routing scheme is robust in the face of cache failures, is tunable for heterogeneous caches, and can have signiicant performance advantages over ICP.
منابع مشابه
ShortCuts: Using Soft State to Improve DHT Routing
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and search, and content delivery systems. The performance of these applications built on DHTs fundamentally depends on the effectiveness of request routing within the DHT. In this paper, we show how to use soft state to achiev...
متن کاملProxy Caching with Hash Functions
Internet traffic doubles every three months, with web traffic accounting for more than 75% of the total traffic between major ISP providers. Web caching at proxies can reduce this traffic as well as web user latencies. One way to increase the hit rate of caches is to have caches cooperate using the Internet Cache Protocol or using hash functions. This paper provides an experimental and theoreti...
متن کاملURL Forwarding and Compression in Adaptive Web Caching
Web caching is generally acknowledged as an important service for alleviating focused overloads when certain web servers’ contents suddenly become popular. Cooperative caching systems are more effective than independent caches due to the larger collective backing store that cooperation creates. One such system currently being developed at UCLA, Adaptive Web Caching (AWC), uses an application-le...
متن کاملEfficient Hash-routing and Domain Clustering Techniques for Information-Centric Networks
Hash-routing is a well-known technique used in server-cluster environments to direct content requests to the responsible servers hosting the requested content. In this work, we look at hash-routing from a different angle and apply the technique to Information-Centric Networking (ICN) environments, where in-network content caches serve as temporary storage for content. In particular, edge-domain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997